Fast and Memory-Efficient Regular Expression Matching Using Transition Sharing
نویسندگان
چکیده
منابع مشابه
Fast, memory-efficient regular expression matching with NFA-OBDDs
1389-1286/$ see front matter 2011 Elsevier B.V doi:10.1016/j.comnet.2011.07.002 q This article is a revised and expanded versio appears in the 13th International Symposium on Intrusion Detection (RAID’10) [55]. ⇑ Corresponding author. Tel.: +1 732 445 2001x3 ⇑⇑ Principle corresponding author. Fax: +1 732 445 E-mail addresses: [email protected] (L. Yang edu (R. Karim), [email protected]...
متن کاملFast Regular Expression Matching Using FPGA
With the growing number of viruses and network attacks, Intrusion Detection Systems have to match a large set of regular expressions at multi-gigabit speed to detect malicious activities on the network. Many algorithms and architectures have been designed to accelerate pattern matching, but most of them can be used only for strings or a small set of regular expressions. The capacity of availabl...
متن کاملSDFA: Series DFA for Memory-Efficient Regular Expression Matching
Regular expression (RegEx) matching plays an important role in various network, security and database applications. Deterministic finite automata (DFA) is the preferred representation to achieve online RegEx matching in backbone networks, because of its one single pass over inputs for multiple RegExes and guaranteed performance of O(1) memory bandwidth per symbol. However, DFA may occupy prohib...
متن کاملFast and compact regular expression matching
We study 4 problems in string matching, namely, regular expression matching, approximate regular expression matching, string edit distance, and subsequence indexing, on a standard word RAM model of computation that allows logarithmic-sized words to be manipulated in constant time. We show how to improve the space and/or remove a dependency on the alphabet size for each problem using either an i...
متن کاملFast and Memory Efficient NFA Pattern Matching using GPU
Network intrusion detection system (NIDS) is mainly designed to monitor the malicious packets spreading on the Internet. With pre-defined virus signatures called patterns, NIDS can find out whether these pre-defined patterns exist in the packet’s payload. GPU can be useful to effectively accelerate pattern matching process due to abundant parallel hardware threads. In this paper, we propose a c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2009
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e92.d.1953